- symmetric closure
- вчт. симметричное замыкание
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
symmetric closure
Смотреть что такое "symmetric closure" в других словарях:
Closure (mathematics) — For other uses, see Closure (disambiguation). In mathematics, a set is said to be closed under some operation if performance of that operation on members of the set always produces a unique member of the same set. For example, the real numbers… … Wikipedia
Closure with a twist — is a property of subsets of an algebraic structure. A subset Y of an algebraic structure X is said to exhibit closure with a twist if for every two elements there exists an automorphism ϕ of X and an element such that … Wikipedia
Extensions of symmetric operators — In functional analysis, one is interested in extensions of symmetric operators acting on a Hilbert space. Of particular importance is the existence, and sometimes explicit constructions, of self adjoint extensions. This problem arises, for… … Wikipedia
Hermitian symmetric space — In mathematics, a Hermitian symmetric space is a Kähler manifold M which, as a Riemannian manifold, is a Riemannian symmetric space. Equivalently, M is a Riemannian symmetric space with a parallel complex structure with respect to which the… … Wikipedia
Automorphisms of the symmetric and alternating groups — In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the… … Wikipedia
law of closure — noun a Gestalt principle of organization holding that there is an innate tendency to perceive incomplete objects as complete and to close or fill gaps and to perceive asymmetric stimuli as symmetric • Syn: ↑closure • Hypernyms: ↑Gestalt law of… … Useful english dictionary
Binary relation — Relation (mathematics) redirects here. For a more general notion of relation, see Finitary relation. For a more combinatorial viewpoint, see Theory of relations. In mathematics, a binary relation on a set A is a collection of ordered pairs of… … Wikipedia
Abstract rewriting system — In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formalism that captures the quintessential notion and properties of… … Wikipedia
Monoid — This article is about the mathematical concept. For the alien creatures in the Doctor Who adventure, see The Ark (Doctor Who). Coherence law for monoid unit In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a… … Wikipedia
Presentation of a monoid — In algebra, a presentation of a monoid (or semigroup) is a description of a monoid (or semigroup) in terms of a set Sigma; of generators and a set of relations on the free monoid Sigma; lowast; (or free semigroup Sigma;+) generated by Sigma;. The … Wikipedia
Preorder — In mathematics, especially in order theory, preorders are binary relations that satisfy certain conditions. For example, all partial orders and equivalence relations are preorders. The name quasiorder is also common for preorders. Other notations … Wikipedia
